Propagator Groups
Identifieur interne : 000C49 ( Main/Exploration ); précédent : 000C48; suivant : 000C50Propagator Groups
Auteurs : Z. Lagerkvist [Suède] ; Christian Schulte [Suède]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
Abstract
Abstract: This paper introduces propagator groups as an abstraction for controlling the execution of propagators as implementations of constraints. Propagator groups enable users of a constraint programming system to program how propagators within a group are executed. The paper exemplifies propagator groups for controlling both propagation order and propagator interaction. Controlling propagation order is applied to debugging constraint propagation and optimal constraint propagation for Berge-acyclic propagator graphs. Controlling propagator interaction by encapsulating failure and entailment is applied to general reification and constructive disjunction. The paper describes an implementation of propagator groups (based on Gecode) that is applicable to any propagator-centered constraint programming system. Experiments show that groups incur little to no overhead and that the applications of groups are practically usable and efficient.
Url:
DOI: 10.1007/978-3-642-04244-7_42
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000645
- to stream Istex, to step Curation: 000510
- to stream Istex, to step Checkpoint: 000720
- to stream Main, to step Merge: 000C59
- to stream Main, to step Curation: 000C49
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Propagator Groups</title><author><name sortKey="Lagerkvist, Z" sort="Lagerkvist, Z" uniqKey="Lagerkvist Z" first="Z." last="Lagerkvist">Z. Lagerkvist</name></author><author><name sortKey="Schulte, Christian" sort="Schulte, Christian" uniqKey="Schulte C" first="Christian" last="Schulte">Christian Schulte</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:3F60CB2C385440944CAAA476E84DECBCE75DBFF5</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-04244-7_42</idno><idno type="url">https://api.istex.fr/document/3F60CB2C385440944CAAA476E84DECBCE75DBFF5/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000645</idno><idno type="wicri:Area/Istex/Curation">000510</idno><idno type="wicri:Area/Istex/Checkpoint">000720</idno><idno type="wicri:Area/Main/Merge">000C59</idno><idno type="wicri:Area/Main/Curation">000C49</idno><idno type="wicri:Area/Main/Exploration">000C49</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Propagator Groups</title><author><name sortKey="Lagerkvist, Z" sort="Lagerkvist, Z" uniqKey="Lagerkvist Z" first="Z." last="Lagerkvist">Z. Lagerkvist</name><affiliation wicri:level="1"><country xml:lang="fr">Suède</country><wicri:regionArea>KTH – Royal Institute of Technology</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Suède</country></affiliation></author><author><name sortKey="Schulte, Christian" sort="Schulte, Christian" uniqKey="Schulte C" first="Christian" last="Schulte">Christian Schulte</name><affiliation wicri:level="1"><country xml:lang="fr">Suède</country><wicri:regionArea>KTH – Royal Institute of Technology</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Suède</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno></series><idno type="istex">3F60CB2C385440944CAAA476E84DECBCE75DBFF5</idno><idno type="DOI">10.1007/978-3-642-04244-7_42</idno><idno type="ChapterID">Chap42</idno><idno type="ChapterID">42</idno></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper introduces propagator groups as an abstraction for controlling the execution of propagators as implementations of constraints. Propagator groups enable users of a constraint programming system to program how propagators within a group are executed. The paper exemplifies propagator groups for controlling both propagation order and propagator interaction. Controlling propagation order is applied to debugging constraint propagation and optimal constraint propagation for Berge-acyclic propagator graphs. Controlling propagator interaction by encapsulating failure and entailment is applied to general reification and constructive disjunction. The paper describes an implementation of propagator groups (based on Gecode) that is applicable to any propagator-centered constraint programming system. Experiments show that groups incur little to no overhead and that the applications of groups are practically usable and efficient.</div></front></TEI><affiliations><list><country><li>Suède</li></country></list><tree><country name="Suède"><noRegion><name sortKey="Lagerkvist, Z" sort="Lagerkvist, Z" uniqKey="Lagerkvist Z" first="Z." last="Lagerkvist">Z. Lagerkvist</name></noRegion><name sortKey="Lagerkvist, Z" sort="Lagerkvist, Z" uniqKey="Lagerkvist Z" first="Z." last="Lagerkvist">Z. Lagerkvist</name><name sortKey="Schulte, Christian" sort="Schulte, Christian" uniqKey="Schulte C" first="Christian" last="Schulte">Christian Schulte</name><name sortKey="Schulte, Christian" sort="Schulte, Christian" uniqKey="Schulte C" first="Christian" last="Schulte">Christian Schulte</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C49 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000C49 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:3F60CB2C385440944CAAA476E84DECBCE75DBFF5
|texte= Propagator Groups
}}
| This area was generated with Dilib version V0.6.20. |  |